Global optimal solutions to nonconvex optimisation problems with a sum of double-well and log-sum-exp functions
نویسندگان
چکیده
This paper presents a canonical dual approach for solving a nonconvex global optimisation problem with a sum of double-well and log-sum-exp functions. Such a problem arises extensively in mechanics, robot designing, information theory and network communication systems. It includes fourth-order polynomial minimisation problems and minimax problems. Based on the canonical duality theory, this nonconvex problem is transformed to an equivalent dual problem, and the triality theory explicates that under certain condition the dual problem can be solved easily and, correspondingly, the global solution of the primal problem can be obtained analytically from the dual solution. It also discusses the relationships between local extremums of the primal problem and the dual problem. Furthermore, two specific problems, a fourth-order polynomial minimisation problem and a minimax problem, are discussed and situations when the condition in the triality theory holds are presented. In the end, several numerical examples are provided to illustrate the application of canonical duality theory on this problem.
منابع مشابه
A global optimization algorithm for sum of quadratic ratios problem with coefficients
In this paper a global optimization algorithm for solving sum of quadratic ratios problem with coefficients and nonconvex quadratic function constraints (NSP ) is proposed. First, the problem NSP is converted into an equivalent sum of linear ratios problem with nonconvex quadratic constraints ( LSP ). Using linearization technique, the linearization relaxation of LSP is obtained. The whole prob...
متن کاملGlobal solutions to fractional programming problem with ratio of nonconvex functions
This paper presents a canonical dual approach for minimizing a sum of quadratic function and a ratio of nonconvex functions in R. By introducing a parameter, the problem is first equivalently reformed as a nonconvex polynomial minimization with elliptic constraint. It is proved that under certain conditions, the canonical dual is a concave maximization problem in R that exhibits no duality gap....
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملDynamic combinatorial optimisation problems: an analysis of the subset sum problem
The field of evolutionary computation has traditionally focused on static optimisation problems. Recently, many new approaches have been proposed that adapt traditional evolutionary algorithms to the dynamic domain to deal with the task of tracking high-quality solutions as the search space changes over time. These novel algorithms are subsequently evaluated on a wide range of different optimis...
متن کاملAdaptive weighted-sum method for bi-objective optimization: Pareto front generation
This paper presents a new method that effectively determines a Pareto front for bi-objective optimization with potential application to multiple objectives. A traditional method for multiobjective optimization is the weighted-sum method, which seeks Pareto optimal solutions one by one by systematically changing the weights among the objective functions. Previous research has shown that this met...
متن کامل